Extended Formulations for Independence Polytopes of Regular Matroids
نویسندگان
چکیده
Abstract. We show that the independence polytope of every regular matroid has an extended formulation of size quadratic in the size of its ground set. This generalizes a similar statement for (co-)graphic matroids, which is a simple consequence of Martin’s [9] extended formulation for the spanning-tree polytope. In our construction, we make use of Seymour’s decomposition theorem for regular matroids. As a consequence, the extended formulations can be computed in polynomial time.
منابع مشابه
Extended Formulations for Polytopes of Regular Matroids
We present a simple proof of the fact that the base (and independence) polytope of a rank n regular matroid over m elements has an extension complexity O(mn).
متن کاملSubgraph polytopes and independence polytopes of count matroids
Given an undirected graph, the non-empty subgraph polytope is the convex hull of the characteristic vectors of pairs (F, S) where S is a nonempty subset of nodes and F is a subset of the edges with both endnodes in S. We obtain a strong relationship between the non-empty subgraph polytope and the spanning forest polytope. We further show that these polytopes provide polynomial size extended for...
متن کاملUncapacitated Flow-based Extended Formulations
An extended formulation of a polytope is a linear description of this polytope using extra variables besides the variables in which the polytope is defined. The interest of extended formulations is due to the fact that many interesting polytopes have extended formulations with a lot fewer inequalities than any linear description in the original space. This motivates the development of methods f...
متن کاملConstructing Extended Formulations from Reflection Relations
There are many examples of optimization problems whose associated polyhedra can be described much nicer, and with way less inequalities, by projections of higher dimensional polyhedra than this would be possible in the original space. However, currently not many general tools to construct such extended formulations are available. In this paper, we develop a framework of polyhedral relations tha...
متن کاملThe Universality Theorems for Oriented Matroids and Polytopes
Universality Theorems are exciting achievements in the theories of polytopes and oriented matroids. This article surveys the main developments in that context. We explain the basic constructions that lead to Universality Theorems. In particular, we show that one can use the Universality Theorem for rank 3 oriented matroids to obtain a Universality Theorem for 6-dimensional polytopes. 1 Universa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Graphs and Combinatorics
دوره 32 شماره
صفحات -
تاریخ انتشار 2016